Universality Reduced

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lepton Universality

The topic of lepton universality is directly related to the structure of the fundamental fermion elds and the dynamics generating it. It can be investigated independently for the charged and the neutral weak interactions. The precise measurements of the neutral couplings achieved at LEP and SLC are the key ingredients for the investigation of electroweak radiative corrections and the indirect i...

متن کامل

Generalized Universality

State machine replication reduces distributed to centralized computing. Any sequential service, modeled by a state machine, can be replicated over any number of processes and made highly available to all of them. At the heart of this fundamental reduction lies the so called universal consensus abstraction, key to providing the illusion of single shared service, despite replication. Yet, as univ...

متن کامل

Complex Universality

The theory of period doublings for one-parameter families of iterated real mappings is generalized to period n-tuplings for complex mappings. An n-tupling occurs when the eigenvalue of a stable periodic orbit passes through the value ω = exp(2τπm/n) as the parameter value is changed. Each choice of m defines a different sequence of rc-tuplings, for which we construct a period ft-tupling renorma...

متن کامل

Honest universality.

We extend the notion of universality of a function, due to Turing, to arbitrary (countable) effective domains, taking care to disallow any cheating on the part of the representations used. Then, we can be certain that effective universal functions cannot simulate non-effective functions.

متن کامل

Visibly pushdown automata on trees: universality and u-universality

An automaton is universal if it accepts every possible input. We study the notion of u-universality, which asserts that the automaton accepts every input starting with u. Universality and u-universality are both EXPTIME-hard for non-deterministic tree automata. We propose efficient antichain-based techniques to address these problems for visibly pushdown automata operating on trees. One of our ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Philosophy of Science

سال: 2019

ISSN: 0031-8248,1539-767X

DOI: 10.1086/705473